A Subspace Embedding Method inL2Norm via Fast Cauchy Transform
نویسندگان
چکیده
منابع مشابه
Solving Ill-Posed Cauchy Problems by a Krylov Subspace Method
We study the numerical solution of a Cauchy problem for a self-adjoint elliptic partial differential equation uzz − Lu = 0 in three space dimensions (x, y, z) , where the domain is cylindrical in z. Cauchy data are given on the lower boundary and the boundary values on the upper boundary is sought. The problem is severely illposed. The formal solution is written as a hyperbolic cosine function ...
متن کاملA fast subspace method for image deblurring
Image deblurring problems appear frequently in astronomical image analysis. For image deblurring problems, it is reasonable to add a non-negativity constraint because of the physical meaning of the image. Previous research works are mainly full-space methods, i.e., solving a regularized optimization problem in a full space. To solve the problem more efficiently, we propose a subspace method. We...
متن کاملFast Approximate Fourier Transform via Wavelets Transform
We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coeecients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...
متن کاملThe Fast Cauchy Transform and Faster Robust Linear Regression
We provide fast algorithms for overconstrained `p regression and related problems: for an n× dinput matrix A and vector b ∈ R, in O(nd log n) time we reduce the problem minx∈Rd ‖Ax− b‖pto the same problem with input matrix à of dimension s× d and corresponding b̃ of dimensions × 1. Here, à and b̃ are a coreset for the problem, consisting of sampled and rescaled rowsof A and b; and...
متن کاملCauchy Graph Embedding
Laplacian embedding provides a lowdimensional representation for the nodes of a graph where the edge weights denote pairwise similarity among the node objects. It is commonly assumed that the Laplacian embedding results preserve the local topology of the original data on the low-dimensional projected subspaces, i.e., for any pair of graph nodes with large similarity, they should be embedded clo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/392034